Complexity volumes of splittable groups

Complexity and approximability of k-splittable flows

Let G = (V, E) be a graph with a source node s and a sink node t, |V | = n, |E| = m. For a given number k, the Maximum k–Splittable Flow Problem (MkSF) is to find an s, t–flow of maximum value with a flow decomposition using at most k paths. In the multicommodity case this problem generalizes disjoint paths problems and unsplittable flow problems. We provide a comprehensive overview of the comp...

Volumes of Discrete Groups and Topological Complexity of Homology Spheres

Can one ascribe a “size” to a discrete group? By that we mean a real-valued invariant, μ(Γ) satisfying the following condition: for any subgroup ∆ < Γ of finite index, μ(∆) = (Γ : ∆)μ(Γ). The importance of such an invariant for the structure of Γ is clear from the following observation: if μ(Γ) > 0 and ∆1,∆2 are two isomorphic subgroups of Γ of finite index, then (Γ : ∆1) = (Γ : ∆2). Some ratio...

Approximation and Complexity of k-Splittable Flows

Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most k paths [6]. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable flow problems. Constructing a k–splittable flow requires two interdepending decisions. One has to decide ...

Completely Splittable Representations of Symmetric Groups

the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing

بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...